Maximizing a class of submodular utility functions
نویسندگان
چکیده
منابع مشابه
Maximizing a class of submodular utility functions
Given a finite ground set N and a value vector a ∈ RN , we consider optimization problems involving maximization of a submodular set utility function of the form h(S) = f i∈S ai ) , S ⊆ N , where f is a strictly concave, increasing, differentiable function. This utility function appears frequently in combinatorial optimization problems whenmodeling risk aversion and decreasing marginal preferen...
متن کاملMaximizing a class of submodular utility functions with constraints
Motivated by stochastic 0-1 integer programming problems with an expected utility objective, we study the mixed-integer nonlinear set: P = { (w, x) ∈ R× {0, 1}N : w ≤ f (a′x + d), b′x ≤ B } where N is a positive integer, f : R 7→ R is a concave function, a, b ∈ RN are nonnegative vectors, d is a real number and B is a positive real number. We propose a family of inequalities for the convex hull...
متن کاملForthcoming in Mathematical Programming MAXIMIZING A CLASS OF SUBMODULAR UTILITY FUNCTIONS
Given a finite ground set N and a value vector a ∈ R , we consider optimization problems involving maximization of a submodular set utility function of the form h(S) = f (∑ i∈S ai ) , S ⊆ N , where f is a strictly concave, increasing, differentiable function. This function appears frequently in combinatorial optimization problems when modeling risk aversion and decreasing marginal preferences, ...
متن کاملMaximizing Stochastic Monotone Submodular Functions
We study the problem of maximizing a stochastic monotone submodular function with respect to a matroid constraint. Our model can capture the effect of uncertainty in different problems, such as cascade effects in social networks, capital budgeting, sensor placement, etc. We study the adaptivity gap the ratio between the values of optimal adaptive and non-adaptive policies and show that it is eq...
متن کاملA Deterministic Algorithm for Maximizing Submodular Functions
The problem of maximizing a non-negative submodular function was introduced by Feige, Mirrokni, and Vondrak [FOCS’07] who provided a deterministic local-search based algorithm that guarantees an approximation ratio of 1 3 , as well as a randomized 2 5 -approximation algorithm. An extensive line of research followed and various algorithms with improving approximation ratios were developed, all o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2009
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-009-0298-1